Bouquets of circles for lamination languages and complexities
نویسنده
چکیده
Laminations are classic sets of disjoint and non-self-crossing curves on surfaces. Lamination languages are languages of two-way infinite words which code laminations by using associated labeled embedded graphs, and which are subshifts. Here, we characterize the possible exact affine factor complexities of these languages through bouquets of circles, i.e. graphs made of one vertex, as representative coding graphs. We also show how to build families of laminations together with corresponding lamination languages covering all the possible exact affine
منابع مشابه
Flexibility of Embeddings of Bouquets of Circles on the Projective Plane and Klein Bottle
In this paper, we study the flexibility of embeddings of bouquets of circles on the projective plane and the Klein bottle. The numbers (of equivalence classes) of embeddings of bouquets of circles on these two nonorientable surfaces are obtained in explicit expressions. As their applications, the numbers (of isomorphism classes) of rooted one-vertex maps on these two nonorientable surfaces are ...
متن کاملA formula for the coincidence Reidemeister trace of selfmaps on bouquets of circles
We give a formula for the coincidence Reidemeister trace of selfmaps on bouquets of circles in terms of the Fox calculus. Our formula reduces the problem of computing the coincidence Reidemeister trace to the problem of distinguishing doubly twisted conjugacy classes in free groups.
متن کاملQuaternionic Product of Circles and Cycles and Octonionic Product for Pairs of Circles
This paper concerns with a product of circles induced by the quaternionic product considered in a projective manner. Several properties of this composition law are derived and on this way we arrive at some special numbers as roots or powers of unit. We extend this product to cycles as oriented circles and to pairs of circles by using the algebra of octonions. Three applications of the given pro...
متن کاملElastic Behavior of Functionally Graded Two Tangled Circles Chamber
This paper presents the numerical elastic solution for a real problem, functionally graded chamber of hydraulic gear pumps under internal pressure. Because of the similarity and complexity for the considering geometry, a bipolar cylindrical coordinate system is used to extract the governing equations. The material properties are considered to vary along the two tangled circles with a power-law ...
متن کاملCoding Non-orientable Laminations
Surface laminations are classic closed sets of disjoint curves in surfaces. We give here a full description of how to obtain codings of such laminations when they are non-orientable by using lamination languages, i.e. specific linear complexity languages of two-way infinite words. We also compare lamination languages with symbolic laminations, i.e. the coding counterparts of algebraic laminations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- RAIRO - Theor. Inf. and Applic.
دوره 48 شماره
صفحات -
تاریخ انتشار 2014